https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:23687 Wed 19 Apr 2023 16:42:57 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11086 Wed 11 Apr 2018 16:49:56 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:16800 Wed 11 Apr 2018 14:17:27 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:12280 Wed 11 Apr 2018 13:25:16 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:25143 Tue 27 Mar 2018 15:15:35 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:21139 Disclosed, mines disjunctive closed itemsets by exploring the search space in a depth-first, top-down manner. We evaluated the performance of our algorithm to execute such a task using real microarray gene expression data sets publicly available on the Internet. Our experiments revealed under what situations, the characteristics of a data set, our method obtain a good, bad or average performance. We also compared the performance of our method with the state of the art algorithms for finding disjunctive closed patterns and disjunctive minimal generators. We observed that our approach is two orders of magnitude more efficient, both in terms of time and memory.]]> Sat 24 Mar 2018 07:54:05 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:18492 Sat 24 Mar 2018 07:51:23 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:21967 Sat 24 Mar 2018 07:14:33 AEDT ]]>